ABCP: Automatic Block-wise and Channel-wise Network Pruning via Joint Search

نویسندگان

چکیده

Currently, an increasing number of model pruning methods are proposed to resolve the contradictions between computer powers required by deep learning models and resource-constrained devices. However, for simple tasks like robotic detection, most traditional rule-based network can not reach a sufficient compression ratio with low accuracy loss time-consuming as well laborious. In this paper, we propose Automatic Block-wise Channel-wise Network Pruning (ABCP1Our code is released at https://github.com/DRL-CASIA/ABCP.) jointly search block-wise channel-wise action detection reinforcement learning. A joint sample algorithm simultaneously generate choice each residual block channel convolutional layer from discrete continuous space respectively. The best taking both complexity into account obtained finally. Compared method, pipeline saves human labor achieves higher lower loss. Tested on mobile robot dataset, pruned YOLOv3 99.5% FLOPs, reduces parameters, 37.3× speed up only 2.8% mAP On sim2real dataset task, 9.6% better than baseline model, showing robustness performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Block-wise Neural Network Architecture Generation

Convolutional neural networks have gained a remarkable success in computer vision. However, most usable network architectures are hand-crafted and usually require expertise and elaborate design. In this paper, we provide a block-wise network generation pipeline called BlockQNN which automatically builds high-performance networks using the Q-Learning paradigm with epsilon-greedy exploration stra...

متن کامل

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Block-Wise Non-Malleable Codes

Non-malleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10) provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c′ either decodes to m or to “something unrelated” to m. It is known that non-malleable codes cannot exist for the class of all tampering functions and hence a lot of work has focused on explicitly constructing...

متن کامل

Point-wise Convolutional Neural Network

Deep learning with 3D data such as reconstructed point clouds and CAD models has received great research interests recently. However, the capability of using point clouds with convolutional neural network has been so far not fully explored. In this paper, we present a convolutional neural network for semantic segmentation and object recognition with 3D point clouds. At the core of our network i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Cognitive and Developmental Systems

سال: 2022

ISSN: ['2379-8920', '2379-8939']

DOI: https://doi.org/10.1109/tcds.2022.3230858